A Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks

In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes the number of channels subject to hard constraints on the blocking and dropping probabilities of calls. Finally, we propose an optimal prioritized channel assignment for multi-cells cellular networks with two classes of voice users.